SUBMITTED TO THE IEEE TRANSACTIONS ON NEURAL NETWORKS , 1999 1 SVMs for Histogram - Based ImageClassi

نویسندگان

  • Olivier Chapelle
  • Patrick Ha
  • Vladimir Vapnik
چکیده

Traditional classiication approaches generalize poorly on image classiication tasks, because of the high dimensionality of the feature space. This paper shows that Support Vector Machines (SVM) can generalize well on diicult image classiication problems where the only features are high dimensional histograms. Heavy-tailed RBF kernels of the form K(x; y) = e ? P i jx a i ?y a i j b with a 1 and b 2 are evaluated on the classiication of images extracted from the Corel Stock Photo Collection and shown to far outperform traditional polynomial or Gaussian RBF kernels. Moreover, we observed that a simple remapping of the input x i ! x a i improves the performance of linear SVMs to such an extend that it makes them, for this problem, a valid alternative to RBF kernels. IV Average error rates on Corel14. Each columns corresponds to a diierent kernel. The rst line reports the average number of support vectors required for the full recognizer (i.e. 14 \one against the others" SVM classiiers). The next lines report the error rates using nonlinear input remappings (exponentiation by a). VII Class-confusion matrix for a = 0:25 and b = 1:0. For example, row (1) indicates that on the 386 images of the Airplanes category, 341 have been correctly classiied, 22 have been classiied

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Polynomial Growth Transforms for Design and Training of Generalized Support Vector Machines.

Growth transformations constitute a class of fixed-point multiplicative update algorithms that were originally proposed for optimizing polynomial and rational functions over a domain of probability measures. In this paper, we extend this framework to the domain of bounded real variables which can be applied towards optimizing the dual cost function of a generic support vector machine (SVM). The...

متن کامل

Fuzzy support vector machines

A support vector machine (SVM) learns the decision surface from two distinct classes of the input points. In many applications, each input point may not be fully assigned to one of these two classes. In this paper, we apply a fuzzy membership to each input point and reformulate the SVMs such that different input points can make different contributions to the learning of decision surface. We cal...

متن کامل

Probabilistic Contaminant Source Identification in Water Distribution Infrastructure Systems

Large water distribution systems can be highly vulnerable to penetration of contaminant factors caused by different means including deliberate contamination injections. As contaminants quickly spread into a water distribution network, rapid characterization of the pollution source has a high measure of importance for early warning assessment and disaster management. In this paper, a methodology...

متن کامل

Content-based audio classification and retrieval by support vector machines

Support vector machines (SVMs) have been recently proposed as a new learning algorithm for pattern recognition. In this paper, the SVMs with a binary tree recognition strategy are used to tackle the audio classification problem. We illustrate the potential of SVMs on a common audio database, which consists of 409 sounds of 16 classes. We compare the SVMs based classification with other popular ...

متن کامل

The evidence framework applied to support vector machines

In this paper, we show that training of the support vector machine (SVM) can be interpreted as performing the level 1 inference of MacKay's evidence framework.We further on show that levels 2 and 3 of the evidence framework can also be applied to SVMs. This integration allows automatic adjustment of the regularization parameter and the kernel parameter to their near-optimal values. Moreover, it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999